Digital Circuits for Binary Arithmetic
نویسندگان
چکیده
منابع مشابه
Design Space Exploration of Binary Arithmetic Circuits and Design of Circuits for Alternative Arithmetic Systems
The purpose of this master's thesis was to explore the circuit design space (speed, area, power) of conventional binary arithmetic and to suggest improvements or alternatives to this arithmetic. The alternatives to the binary arithmetic focused on was the Signed-Digit (SD) number system, the Residue Number System (RNS) and the combination of these two systems (RNS+SD). The work resulted in new ...
متن کاملStatic Simulation of CNTFET-based Digital Circuits
In this paper we implement a simple DC model for CNTFETs already proposed by us in order to carry out static analysis of basic digital circuits. To verify the validity of the obtained results, they are compared with those of Wong model, resulting in good agreement, but obtaining a lighter ensuring compile and shorter execution time, which are the main character...
متن کاملRestructuring of Arithmetic Circuits with Biconditional Binary Decision Diagrams
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of canonical binary decision diagrams where the branching condition, and its associated logic expansion, is biconditional on two variables. In this demonstration, we use an efficient BBDD manipulation package as front-end to a commercial synthesis tool to restructure arithmetic operations in critical components of telecommunicatio...
متن کاملVeri cation of Arithmetic Circuits Using Binary MomentDiagrams ?
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitrary functions from Boolean variables to real, rational, or integer values. BMDs can thus model the functionality of data path circuits operating over word level data. Many i...
متن کاملAlgorithms for Arithmetic Circuits
Given a multivariate polynomial f(X) ∈ F[X] as an arithmetic circuit we would like to efficiently determine: 1. Identity Testing. Is f(X) identically zero? 2. Degree Computation. Is the degree of the polynomial f(X) at most a given integer d . 3. Polynomial Equivalence. Upto an invertible linear transformation of its variables, is f(X) equal to a given polynomial g(X). The algorithmic complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1980
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/23.3.269